Shi Threshold Arrangement

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shi Threshold Arrangement

Richard Stanley suggested the problem of finding the characteristic polynomial of a certain hyperplane arrangement defined by xi + xj = 0, 1, which is called the Shi threshold arrangement. We present the answer of the problem, using the finite field method.

متن کامل

The Shi arrangement and the Ish arrangement

This paper is about two arrangements of hyperplanes. The first — the Shi arrangement — was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type A. The second — the Ish arrangement — was recently defined by the first author who used the two arrangements together to give a new interpretation of the q, t-Catalan numbers of Garsia and Haiman. In the prese...

متن کامل

The Catalan Threshold Arrangement

Hyperplane arrangements are very interesting combinatorial objects and many results can be found in the literature. For instance, several papers [1, 2, 6, 7] are concerned with the characteristic polynomials and the number of regions of a hyperplane arrangement. In his paper [9], Stanley reviewed various hyperplane arrangements raising interesting questions, one of which is related to the follo...

متن کامل

Labeling the Regions of the Type Cn Shi Arrangement

The number of regions of the type Cn Shi arrangement in Rn is (2n + 1)n. Strikingly, no bijective proof of this fact has been given thus far. The aim of this paper is to provide such a bijection and use it to prove more refined results. We construct a bijection between the regions of the type Cn Shi arrangement in Rn and sequences a1a2 . . . an, where ai ∈ {−n,−n+1, . . . ,−1, 0, 1, . . . , n−1...

متن کامل

A Labelling of the Faces in the Shi Arrangement

Let Fn be the face poset of the n-dimensional Shi arrangement, and let Pn be the poset of parking functions of length n with the order defined by (a1, a2, . . . , an) ≤ (b1, b2, . . . , bn) if ai ≤ bi for all i. Pak and Stanley constructed a labelling of the regions in Fn using the elements of Pn. We show that under this labelling, all faces in Fn correspond naturally to closed intervals of Pn,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2012

ISSN: 1077-8926

DOI: 10.37236/2046